一种基于FCOS神经网络的小建筑物目标检测方法北大核心

提出了一种基于FCOS神经网络的小建筑物目标检测算法,针对FCOS模型在特征提取阶段提取到的小建筑物目标特征较少问题,引入多尺度检测和可变形卷积方式,加强网络对小建筑物目标的特征提取能力,并通过改进后的SGE注意力机制降低特征图中的干扰噪声权重。改进后的网络可以提取到更多的小建筑物目标特征,对环境干扰噪声的鲁棒性更强。在自己搭建的数据集上进行了实验测试,结果表明,在相同环境下网络改进后建筑物的整体检测准确率提升了1.7%,其中对小建筑物目标提升了3.6%,减少了小建筑物目标漏检、误检的问题。     

基于多尺度的贝叶斯模型显著性检测

针对传统基于贝叶斯模型的显著性检测算法存在准确率不理想的问题,提出了一种基于多尺度的贝叶斯模型显著性检测算法。通过超像素分割算法(SLIC)将原图分割成不同尺度的超像素,根据超像素边界信息得到背景种子,进而通过距离计算和多尺度融合得到背景先验;对原图进行颜色增强,采用Harris算子对增强图进行检测角点求得凸包,融合不同尺度下的超像素得到凸包先验;融合背景先验和凸包先验得到最终先验;利用颜色直方图和凸包计算似然概率;将最终先验和似然概率通过贝叶斯模型计算显著图。在公开数据集MSRA1000、ECSSD上与多种传统算法进行准确率和召回率对比,该算法有更好的表现。     

An improved machine learning technique based on downsized KPCA for Alzheimer's disease classification

Alzheimer's disease (AD), a neurodegenerative disorder, is a very serious illness that cannot be cured, but the early diagnosis allows precautionary measures to be taken. The current used methods to detect Alzheimer's disease are based on tests of cognitive impairment, which does not provide an exact diagnosis before the patient passes a moderate stage of AD. In this article, a novel classifier of brain magnetic resonance images (MRI) based on the new downsized kernel principal component analysis (DKPCA) and multiclass support vector machine (SVM) is proposed. The suggested scheme classifies AD MRIs. First, a multiobjective optimization technique is used to determine the optimal parameter of the kernel function in order to ensure good classification results and to minimize the number of retained principle components simultaneously. The optimal parameter is used to build the optimized DKPCA model. Second, DKPCA is applied to normalized features. Downsized features are then fed to the classifier to output the prediction. To validate the effectiveness of the proposed method, DKPCA was tested using synthetic data to demonstrate its efficiency on dimensionality reduction, then the DKPCA based technique was tested on the OASIS MRI database and the results were satisfactory compared to conventional approaches.     

Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand

The average age of the population has grown steadily in recent decades along with the number of people suffering from chronic diseases and asking for treatments. Hospital care is expensive and often unsafe, especially for older individuals. This is particularly true during pandemics as the recent SARS-CoV-2. Hospitalization at home has become a valuable alternative to face efficiently a huge increase in treatment requests while guaranteeing a high quality of service and lower risk to fragile patients. This new model of care requires the redefinition of health services organization and the optimization of scarce resources (e.g., available nurses). In this paper, we study a Nurse Routing Problem that tries to find a good balance between hospital costs reduction and the well-being of patients, also considering realistic operational restrictions like maximum working times for the nurses and possible incompatibilities between services jointly provided to the same patient. We first propose a Mixed Integer Linear Programming formulation for the problem and use some valid inequalities to strengthen it. A simple branch-and-cut algorithm is proposed and validated to derive ground benchmarks. In addition, to efficiently solve the problem, we develop an Adaptive Large Neighborhood Search hybridized with a Kernel Search and validate its performance over a large set of different realistic working scenarios. Computational tests show how our matheuristic approach manages to find good solutions in a reasonable amount of time even in the most difficult settings. Finally, some interesting managerial insights are discussed through an economic analysis of the operating context.     

基于多尺度双线性卷积神经网络的多角度下车型精细识别

针对多角度下车辆出现一定的尺度变化和形变导致很难被准确识别的问题，提出基于多尺度双线性卷积神经网络（MS-B-CNN）的车型精细识别模型。首先，对双线性卷积神经网络（B-CNN）算法进行改进，提出MS-B-CNN算法对不同卷积层的特征进行了多尺度融合，以提高特征表达能力；此外，还采用基于中心损失函数与Softmax损失函数联合学习的策略，在Softmax损失函数基础上分别对训练集每个类别在特征空间维护一个类中心，在训练过程中新增加样本时，网络会约束样本的分类中心距离，以提高多角度情况下的车型识别的能力。实验结果显示，该车型识别模型在CompCars数据集上的正确率达到了93.63%，验证了模型在多角度情况下的准确性和鲁棒性。     

基于双重金字塔网络的视频目标分割方法

针对复杂视频场景中难以分割特定目标的问题，提出一种基于双重金字塔网络（DPN）的视频目标分割方法。首先，通过调制网络的单向传递让分割模型适应特定目标的外观。具体而言，从给定目标的视觉和空间信息中学习一种调制器，并通过调制器调节分割网络的中间层以适应特定目标的外观变化。然后，通过基于不同区域的上下文聚合的方法，在分割网络的最后一层中聚合全局上下文信息。最后，通过横向连接的自左而右结构，在所有尺度中构建高阶语义特征图。所提出的视频目标分割方法是一个可以端到端训练的分割网络。大量实验结果表明，所提方法在DAVIS2016数据集上的性能与较先进的使用在线微调的方法相比，可达到相竞争的结果，且在DAVIS2017数据集上性能较优。     

A one-class peeling method for multivariate outlier detection with applications in phase I SPC

In phase I of statistical process control (SPC), control charts are often used as outlier detection methods to assess process stability. Many of these methods require estimation of the covariance matrix, are computationally infeasible, or have not been studied when the dimension of the data, $p$, is large. We propose the one-class peeling (OCP) method, a flexible framework that combines statistical and machine learning methods to detect multiple outliers in multivariate data. The OCP method can be applied to phase I of SPC, does not require covariance estimation, and is well suited to high-dimensional data sets with a high percentage of outliers. Our empirical evaluation suggests that the OCP method performs well in high dimensions and is computationally more efficient and robust than existing methodologies. We motivate and illustrate the use of the OCP method in a phase I SPC application on a $N=354$, $p=1917$ dimensional data set containing Wikipedia search results for National Football League (NFL) players, teams, coaches, and managers. The example data set and R functions, OCP.R and OCPLimit.R, to compute the respective OCP distances and thresholds are available in the supplementary materials.     

船体结构冰载荷反演方法及试验验证

冰载荷是影响船舶冰区航行期间结构安全的重要环境载荷。船舶的冰压监测通常采用应变传感器，合理地布放传感器是识别冰载荷的基础。通过对比船体外板结构试验中的冲击载荷和不同测试方案下的应变信号，确定了最佳应变传感器布放方案；采用Green核函数方法建立了船体外板结构应变冲击载荷间的响应关系，并对采集信号在噪声影响下反演的不适定性进行了分析；采用Tikhonov正则化方法克服了载荷反演过程中出现的数值不稳定问题；最后将试验中的响应用到载荷识别分析中，反演的载荷可以较为准确地反映冲击载荷的时域特征并且载荷识别精度良好。